Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
11	Microsoft Word - orbs7180.doc Add to Reading List Source URL: www.math.hkbu.edu.hk Language: English - Date: 2013-09-27 05:04:48 Operations research Mathematics Computational complexity theory Applied mathematics Mathematical optimization Heuristic Integer programming Relaxation Branch and bound Combinatorial optimization Travelling salesman problem Algorithm
12	Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel † Add to Reading List Source URL: www.cs.huji.ac.il Language: English - Date: 2014-11-26 08:32:33 Graph theory Mathematics Combinatorial optimization Edsger W. Dijkstra Matrix multiplication algorithm NP-complete problems Matching Routing algorithms Computational complexity theory Connected component Dynamic programming Graph coloring
13	Single-Pass List Partitioning Leonor Frias ∗ Universitat Polit`ecnica de Catalunya Dep. de Llenguatges i Sistemes Inform`atics Jordi Girona Salgado, Barcelona, Spain Add to Reading List Source URL: algo2.iti.kit.edu Language: English - Date: 2008-05-15 11:50:35 Mathematics Computational complexity theory Dynamic programming Discrete mathematics Combinatorics Analysis of algorithms Algorithm Mathematical logic Theoretical computer science Time complexity FisherYates shuffle Longest increasing subsequence
14	arXiv:1110.4319v2 [cs.DS] 20 Oct 2011 Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-10-20 20:42:54 Graph theory Computational complexity theory Mathematics NP-complete problems Graph connectivity Combinatorial optimization Cut Approximation algorithm Randomized algorithm Independent set Semidefinite programming Randomized rounding
15	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-03-26 07:24:20 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Steiner tree problem Shortest path problem Linear programming Edge disjoint shortest pair algorithm Minimum bottleneck spanning tree
16	COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used Add to Reading List Source URL: www.amsterdamoptimization.com Language: English - Date: 2011-03-16 12:56:11 Operations research Mathematics Mathematical analysis Computational complexity theory Knapsack problem Cutting stock problem Dynamic programming Pi Linear programming Mathematical optimization Column generation
17	doi:j.ins Add to Reading List Source URL: pbil.univ-lyon1.fr Language: English - Date: 2008-10-22 02:35:21 Theory of computation Dynamic programming Maximal pair String Mathematics String searching algorithm Suffix tree Approximate string matching Time complexity Algorithm Computer science
18	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Language: English - Date: 2012-07-04 18:28:36 Mathematical optimization Mathematics Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method
19	Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science Add to Reading List Source URL: www.ifor.math.ethz.ch Language: English - Date: 2008-11-18 08:48:31 Graph theory Mathematics Constraint programming Discrete mathematics Morphisms Constraint satisfaction problem Graph homomorphism Constraint satisfaction Complexity of constraint satisfaction Graph minor
20	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:36 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Edsger W. Dijkstra Spanning tree Operations research Shortest path problem Graph Linear programming Steiner tree problem